A New Upper Bound on the Star Discrepancy of (0,1)-sequences
نویسنده
چکیده
We study (0, 1)-sequences in arbitrary base b and derive a new upper bound on the star discrepancy of these. Moreover, we show that the van der Corput sequence is the sequence with the highest star discrepancy among all (0, 1)-sequences. The key property of the van der Corput sequence leading to this result is that its points are in a certain sense as close to the origin as possible. The main tool in our work is a recent finding on the discrepancy of (0, m, 2)-nets.
منابع مشابه
Irregularities of Distribution of Digital (0,1)-sequences in Prime Base
In this paper, as an application of our recent results to appear elsewhere [5], we compare digital (0, 1)-sequences generated by nonsingular upper triangular matrices in arbitrary prime bases to van der Corput sequences and show these last ones are the worst distributed with respect to the star discrepancy, the extreme discrepancy, the L2-discrepancy and the diaphony. Moreover, we obtain digita...
متن کاملACTA UNIVERSITATIS APULENSIS No 18/2009 ON G-DISCREPANCY AND MIXED MONTE CARLO AND QUASI-MONTE CARLO SEQUENCES
The G-star and the G-discrepancy are generalizations of the well known star and the extreme discrepancy; thereby G denotes a given continuous distribution function on the d-dimensional unit cube [0, 1]. We list and prove some results that describe the behavior of the G-star and the Gdiscrepancy in terms of the dimension d and the number of sample points N . Our main focus is on so-called mixed ...
متن کاملOn G-Discrepancy and Mixed Monte Carlo and Quasi-Monte Carlo Sequences
The G-star and the G-discrepancy are generalizations of the well known star and the extreme discrepancy; thereby G denotes a given continuous distribution function on the d-dimensional unit cube [0, 1]d. We list and prove some results that describe the behavior of the G-star and the G-discrepancy in terms of the dimension d and the number of sample points N . Our main focus is on so-called mixe...
متن کاملNew star discrepancy bounds for ( t , m , s ) - nets and ( t , s ) - sequences
In this paper, we derive new general upper bounds on the star discrepancy of (t,m, s)-nets and (t, s)-sequences. These kinds of point sets are among the most widely used in quasi-Monte Carlo methods for numerical integration. By our new results, we improve on previous discrepancy bounds and prove a conjecture stated by the second author in an earlier paper.
متن کاملImprovements on the star discrepancy of (t,s)-sequences
The term low-discrepancy sequences is widely used to refer to s-dimensional sequences X satisfying the bound D∗(N,X) ≤ cs(logN) + O((logN)s−1), where D∗ denotes the usual star discrepancy. In this article, we are concerned with (t, s)-sequences in base b, one of the most famous families of low-discrepancy sequences along with Halton sequences. The constants cs for (t, s)-sequences were first co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005